I = lambda:map(int,input().split())
n,b,d=I();*a,=I()
c=0;ans=0
for i in range(n):
if a[i] <= b:
c+=a[i]
if c > d:
ans += 1
c = 0
print(ans)
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
#define ll long long int
const unsigned int mod = 1e9+7;
//(x^y)%mod
// O(log n) -- return , stl power function O(n)
//power function
int power(int a, int b){
if(b==0) return 1;
if(b==1) return a%mod;
ll res = 1;
while(b){
if(b%2==0){
ll ans = power(a,b/2);
return (ans*ans)%mod;
}
else{
ll ans = power(a,(b-1)/2);
return ((a*ans)%mod *ans)%mod;
}
}
return res;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//this is fast I/O (inputput output) use header file <cstdio>
int n,b,d; cin>>n>>b>>d;
//int a[n];
//for(int i=0; i<n;i++) cin>>a[i];
int empty = 0, sum=0;
for(int i=0; i<n; i++){
int x; cin>>x;
if(x<=b) sum+=x;
if(sum>d) empty++, sum=0;
}
cout<<empty<<endl;
return 0;
} 1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |